Pii: S0166-0934(01)00389-5

نویسندگان

  • Christophe Guillon
  • Carel A. van Baalen
  • Patrick H.M. Boers
  • Esther J. Verschuren
  • Rob A. Gruters
  • Albert D.M.E. Osterhaus
چکیده

In this study the construction is described of HIV-1 molecular clones in which CTL epitopes from RT or Env late proteins were inserted into the Nef early protein. The ectopic epitopes were efficiently processed from the recombinant Nef proteins, were recognized by their cognate CTL in cytolytic assays, and did not perturb virus replication or viral protein expression in vitro. These recombinant viruses will therefore be an important tool in studying the effect of distinct epitope expression kinetics on the efficiency of CTL-mediated suppression of HIV-1 replication. © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New complexities for BRCA1 and BRCA2

A large number of diverse functions have been attributed to the BRCA1 and BRCA2 breast cancer susceptibility genes. Here we review recent progress in the field.

متن کامل

Measures on monotone properties of graphs

Given a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. Building on recent results in the enumeration of graphical properties, we prove numerous results about the structure of graphs in Pn and the functions |Pn|. We also examine the measure eP (n), the maximum number of edges in a graph of Pn.

متن کامل

Conway's problem for three-word sets

We prove two results on commutation of languages. First, we show that the maximal language commuting with a three-element language, i.e. its centralizer, is rational, thus giving an a5rmative answer to a special case of a problem proposed by Conway in 1971. Second, we characterize all languages commuting with a three-element code. The characterization is similar to the one proved by Bergman for...

متن کامل

Shattering a set of objects in 2d

In this paper, we propose an algorithm for shattering a set of disjoint line segments of arbitrary length and orientation placed arbitrarily on a 2D plane. The time and space complexities of our algorithm are O(n2) and O(n) respectively. It is an improvement of the O(nlogn) time algorithm proposed in [5]. A minor modi cation of this algorithm applies when objects are simple polygons, keeping th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001